Concurrent algorithms for autonomous robot navigation in an unexplored terrain

Navigation planning is one of the most vital aspects of an autonomous mobile robot. The problem of navigation in a completely known obstacle terrain is solved in many cases. Comparatively less number of research results are reported in literature about robot navigation in a completely unknown obstacle terrain. In recent times, this problem is solved by imparting the learning capability to the robot. The robot explores the obstacles terrain using sensors and incrementally builds the terrain model. As the robot keeps navigating, the terrain model becomes more learned and the usage of sensors is reduced. The navigation paths are computed by making use of the existing terrain model. The navigation paths gradually approach global optimality as the learning proceeds. In this paper, we present concurrent algorithms for an autonomous robot navigation in an Unexplored terrain. These concurrent algorithms are proven to be free from deadlocks and starvation. The performance of the concurrent algorithms is analyzed in terms of the planning time, travel time, scanning time, and update time. The analysis reveals the need for an efiicient data structure for the obstacle terrain in order to reduce the navigation time of the robot, and also to incorporate leaming. The modified adjacency list is proposed as a data structure for the spatial graph that represents the obstacle terrain. The time complexities of various algorithms that access, maintain, and update the spatial graph are estimated, and the effectiveness of the the implementation is illustrated.